منابع مشابه
A lower bound on IMMSE �
This paper provides upper and lower bounds on the information rates achievable with a minimum mean square error (MMSE) Tomlinson-Harashima precoder (THP) assuming ideal interleaving. We also give an exact formula for zero-forcing (ZF) THP achievable information rates. At high SNR, the performance of the MMSE-THP and the ZF-THP identically suuer only the 2.55 bit or 1.53 dB \shaping" loss from c...
متن کاملLower Bound on Testing
We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...
متن کاملA Lower Bound on Opaque Sets
We prove a lower bound of 2.00002 on the the total length of a set (of curves) that intersects every line that intersects the unit square. The best known lower bound has been 2, established by Jones in 1964.
متن کاملA geometric lower bound on Grad's number
In this note we provide a new geometric lower bound on the so-called Grad's number of a domain Ω in terms of how far Ω is from being axisymmetric. Such an estimate is important in the study of the trend to equilibrium for the Boltzmann equation for dilute gases.
متن کاملA Lower Bound on Web Services Composition
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hiroshima Mathematical Journal
سال: 2014
ISSN: 0018-2079
DOI: 10.32917/hmj/1419619746